On the Efficiency of Learning Techniques for Combinational Equivalence Checking
نویسندگان
چکیده
Recursive learning is a general technique for analyzing Boolean problems. In this paper, we evaluate various heuristics for improving the runtime efficiency of this technique when applied to the problem of combinational equivalence checking. All heuristics are evaluated on a set of 29 examples containing the ISCAS benchmarks as well as industrial designs.
منابع مشابه
A Study of Sweeping Algorithms in the Context of Model Checking
Combinational simplification techniques have proved their usefulness in both industrial and academic model checkers. Several combinational simplification algorithms have been proposed in the past that vary in efficiency and effectiveness. In this paper, we report our experience with three algorithms that fall in the combinational equivalence checking (sweeping) category. We propose an improveme...
متن کاملAlgorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is also in the core of algorithms for solving Binate Covering Problems. This paper starts by describing how B...
متن کاملFormal Equivalence Checking of Software Specifications
Ever-growing complexity is forcing logic design to move above the register transfer level (RTL). For example, functional specifications are being written in software. These specifications are written for clarity, and are not optimized or intended for synthesis. Since the software is the target of functional validation, equivalence verification between the software specification and the RTL impl...
متن کاملA BDD - based Veri cation Engine for Combinational
| In this paper we discuss the development of a BDD-based veriication engine for combina-tional equivalence checking. We focus on the techniques used to obtain eecient processing of practical problem instances. These techniques include the detection and utilization of functionally equivalent signals and of isomorphic sub-circuits. Experimental results on well-known benchmarks as well as industr...
متن کاملEquivalence checking of combinational circuits using Boolean expression diagrams
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually or by a design automation tool). This paper introduces a data structure called Boolean Expression Dia...
متن کامل